Low-congested interval routing schemes for hypercubelike networks
نویسندگان
چکیده
In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterflies, wrapped butterflies and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already sufficient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. Moreover, a new lower bound on the congestion achievable by schemes for butterfly networks is provided, which improves upon the best previously known one [20].
منابع مشابه
Low Congested Interval Routing Schemes
In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterries, wrapped butterries and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already suucient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. More...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملStatic and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS Transputer Router Chips. In this paper we consider IRS that are optimal with respect to the congestion of the...
متن کاملLinear Interval Routing
We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 36 شماره
صفحات -
تاریخ انتشار 2000